Extremal Combinatorics - With Applications in Computer Science

Extremal Combinatorics: with Applications in Computer Science by Stasys Jukna, Springer, 2001, xvii + 375 pp

Extremal Combinatorics: with Applications in Computer Science by Stasys Jukna, Springer, 2001, xvii + 375 pp. 32.50; $49.95, ISBN 3540663134

Algebraic Methods in Combinatorics

In the last fifty years, algebraic methods have been used with striking success in combinatorics. This course looks at some of the most important of these methods, and some of the most beautiful results obtained using them. We will also explore connections with combinatorial geometry, probability theory and theoretical computer science. Many questions in extremal combinatorics have the followin...

Methods and Challenges in Extremal and Probabilistic Combinatorics∗ Organizers

Combinatorics, or discrete mathematics, is a fundamental mathematical discipline, concerned with the study of discrete mathematical objects such as graphs, set families and permutations, their typical and extremal properties, and their enumeration. A natural mathematical framework for a large variety of human activities and endeavors, combinatorics has been in existence for thousands of years. ...

Problems and results in extremal combinatorics - II

Extremal Combinatorics is one of the central areas in Discrete Mathematics. It deals with problems that are often motivated by questions arising in other areas, including Theoretical Computer Science, Geometry and Game Theory. This paper contains a collection of problems and results in the area, including solutions or partial solutions to open problems suggested by various researchers. The topi...